Tree-Based Fault-Tolerant Multicast in Multicomputer Networks
نویسندگان
چکیده
A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. The algorithm is provably deadlock-free and livelock-free, requires only a single message startup, and guarantees messages are delivered over shortest paths in the fault-free and traffic-free case. Simulation results in two-dimensional mesh networks show that the algorithm produces significantly shorter average communication latency than previous fault-tolerant multicast algorithms over a range of network loads and fault conditions.
منابع مشابه
Tree-Based Fault-Tolerant Multicast in Multicomputer Networks Using Pipelined Circuit Switching
A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. For every multicast message, a multicast tree is constructed in a distributed and adaptive fashion. An underlying fault-tolerant routing algorithm is used to tolerate faulty nodes and links without requiring nodes to have global fault information. The multicast algorithm is provably deadloc...
متن کاملOptimal Core Selection for Multicast Tree Routing in Hypercube Networks
This paper proposes a set of novel efficient fault-tolerant multicast routing algorithms on hypercube networks using shared tree routing approach. The algorithms can select an optimal core (root) for constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient as compared with the existing multicast algori...
متن کاملA Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...
متن کاملAn Integrated Approach to Efficiently Providing Fault Tolerance for Mobile Multicast
The paper presents an efficient approach to providing fault-tolerant capability for mobile multicast. In multicast communication, packets can be concurrently sent from a source node to all members by a multicast tree. If failures occur in nodes (links) of the multicast tree, the faulty tree will be partitioned into several disconnected subtrees. For the subtrees without the source node, it cann...
متن کاملTMTM - An Efficient Deadlock-Free Tree-Based Multicast Algorithm for 2D Torus Multicomputer
Multicomputer system has high computational power and it can perform multiple tasks concurrently. Torus is a commonly used network topology in building multicomputer system because of many features including low bandwidth, fixed degree of nodes and scalability. The performance of multicomputer highly depends on the underlying network communication such as multicast. This paper suggests an effic...
متن کامل